A completely unambiguous 5-polyhedral graph
نویسندگان
چکیده
منابع مشابه
Optimizing a polyhedral-semidefinite relaxation of completely positive programs
It has recently been shown (Burer, Math Program 120:479–495, 2009) that a large class of NP-hard nonconvex quadratic programs (NQPs) can be modeled as so-called completely positive programs, i.e., the minimization of a linear function over the convex cone of completely positive matrices subject to linear constraints. Such convex programs are NP-hard in general. A basic tractable relaxation is g...
متن کاملEvery Graph Admits an Unambiguous Bold Drawing
Let r and w be a fixed positive numbers, w < r. In a bold drawing of a graph, every vertex is represented by a disk of radius r, and every edge by a narrow rectangle of width w. We solve a problem of van Kreveld [K09] by showing that every graph admits a bold drawing in which the region occupied by the union of the disks and rectangles representing the vertices and edges does not contain any di...
متن کاملA note on “ 5 × 5 Completely positive matrices ”
In their paper “5×5 Completely positive matrices,” Berman and Xu [BX04] attempt to characterize which 5× 5 doubly nonnegative matrices are also completely positive. Most of the analysis in [BX04] concerns a doubly nonnegative matrix A that has at least one off-diagonal zero component. To handle the case where A is componentwise strictly positive, Berman and Xu utilize an “edge-deletion” transfo...
متن کاملNon-redundant Graph Representation of Polyhedral Networks
Infinite homogeneous networks in crystal structures with a single kind of coordination polyhedron and a single kind of connection between polyhedra can be represented by so-called quotient graphs or direction-labeled graphs [1],[2]. These finite graphs may be obtained from periodic nets by graph folding based upon translational symmetries. Taking all given symmetries into account this folding c...
متن کاملPolyhedral studies in Domination Graph Theory (I)
This paper discusses polyhedral approaches to problems in Domination Graph Thoery. We give various linear integer programming formulations for the weighted and unweighted versions of the minimum dominating set problem. We study the associated polytopes and determine dimension of the polytopes, facets, valid inequalities et al. Ideas from integer programming such as lift and project are used to ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Combinatorial Theory
سال: 1970
ISSN: 0021-9800
DOI: 10.1016/s0021-9800(70)80053-9